Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks
نویسندگان
چکیده
In telecommunication networks, full connectivity resilience to multiple link failures is too costly as it requires a network topology with many redundant links. Alternatively, the of telecommunications can be improved by resorting available third-party networks for temporary additional until failing links are restored. this approach, some nodes must selected in advance act gateway when failure event occurs. For given and cost associated each node turn into aim select providing maximum at minimum cost. The Gateway Node Selection defined bi-objective optimization problem such that its Pareto-optimal solutions represent different trade-offs between resilience. work, modeled Critical Link Detection problem. An exact algorithm proposed, based on row generation set cover cuts. computational results demonstrate effectiveness proposed four well-known topologies.
منابع مشابه
Toughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملMaximum Flow of Minimum Bi-criteria Cost in Dynamic Networks
The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations,...
متن کاملUsing Neural Networks with Limited Data to Estimate Manufacturing Cost
Neural networks were used to estimate the cost of jet engine components, specifically shafts and cases. The neural network process was compared with results produced by the current conventional cost estimation software and linear regression methods. Due to the complex nature of the parts and the limited amount of information available, data expansion techniques such as doubling-data and data-cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2023
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22148